Lecture 6: Graph Properties
نویسنده
چکیده
Suppose we are given a graph where vertices correspond to students in the class and edges correspond to friendships. What is the maximum number of students we can put in the exam room, if no two friends should be in the room? If no two friends are allowed to sit in the exam room, there will be no edges between the people sitting in the exam room. This essentially defines the concept of an Independent set. An independent set of a graph G = (V,E) is a subset S of vertices V . In this subset, no two elements u, v of S have an edge between them, (u, v) / ∈ E. It is also called a stable set. The stability number α(G) of a graph G is the maximum possible size of an independent set in the graph. Exercise 1. What is the stability number of the graph given below?
منابع مشابه
Lecture Notes on Testing Graph Properties in the Dense Graph Model
Organization. The current lecture is the first out of a series of three lectures that cover three models for testing graph properties. In each model, we spell out the definition of property testing (when specialized to that model), present some of the known results, and demonstrate some of the ideas involved (by focusing on testing Bipartiteness, which seems a good benchmark). We start the curr...
متن کاملFriendly Logics , Fall 2015 , Lecture Notes
Since we already know (Theorem 1.3 in lecture notes 3) that the data complexity of FOL model checking is in LOGSPACE, we could use common complexity-theoretic assumptions (such as LOGSPACE 6=NP) to conclude that NP-complete properties of finite graphs such as Hamiltonicity, clique or independent set existence, etc. are not FO-definable. However, we might be interested in asking if properties th...
متن کاملRandom and Quasirandom Graphs Lecture 2: Modeling a Random Graph
probability of this graph occurring is ( 1 2 )(n2), i.e. the same probability that we gave above in our probability space. Given this model, a natural sequence of questions to ask is “what properties is a random graph likely to have?” For example, consider counting the number of edges in a random graph, or triangle subgraphs, or connectivity, or other such properties: what should we expect thes...
متن کاملLecture Notes for Interlacing Families
In these notes we follow the two papers [6, 7] where Marcus, Spielman and Srivastava developed a method that they coined the method of interlacing families. In [6] they proved the existence of infinite families of bipartite Ramanujan graphs for all degrees, and in [7] they provided a positive answer to the notorious Kadison– Singer problem. We take the opportunity to have a slightly more genera...
متن کاملProblem Set 6 Solutions
Problem 1. [20 points] The adjacency matrix A of a graph G with n vertices as defined in lecture is an n×n matrix in which Ai,j is 1 if there is an edge from i to j and 0 if there is not. In lecture we saw how the smallest k where Ai,j 6= 0 describes the length of the shortest path from i to j. Given a combinatorial interpretation of the following statements about the adjacency matrix in terms ...
متن کاملLecture 5 — 10 February, 2014: ``5. Properties of the Lasserre Relaxation.''
http://www.csc.kth.se/~lauria/sos14/ Disclaimer: this lecture note has not yet been reviewed by the main lecturer. It is released as it is for the convenience of the students. In this lecture, we study the properties of the solution vectors of the Lasserre relaxation. We start with some basic properties of the solutions, and then continue to show that the solution vectors give us a family of lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015